Efficient Aggregation Algorithms on XML Stream

Efficient Algorithms for Optimal Stream Merging for Media-on-Demand

We address the problem of designing optimal off-line algorithms that minimize the required bandwidth for media-on-demand systems that use stream merging. We concentrate on the case where clients can receive two media streams simultaneously and can buffer up to half of a full stream. We construct an O(nm) optimal algorithm for n arbitrary time arrivals of clients, where m is the average number o...

Efficient algorithms for optimal stream merging for media-on-demand

Efficient XML Stream Processing with Automata and Query Algebra

XML Stream Processing is an emerging technology designed to support declarative queries over continuous streams of data. The interest in this novel technology is growing due to the increasing number of real world applications such as monitoring systems for stock, email, and sensor data that need to analyze incoming data streams. There are however several open challenges. One, we must develop ef...

Energy and Latency Efficient Access of Wireless XML Stream

In this article, we address the problem of delayed query processing raised by tree-based index structures in wireless broadcast environments, which increases the access time of mobile clients. We propose a novel distributed index structure and a clustering strategy for streaming XML data that enables energy and latency-efficient broadcasting of XML data. We first define the DIX node structure t...

Efficient Aggregation Algorithms for Compressed Data Warehouses

ÐAggregation and cube are important operations for online analytical processing (OLAP). Many efficient algorithms to compute aggregation and cube for relational OLAP have been developed. Some work has been done on efficiently computing cube for multidimensional data warehouses that store data sets in multidimensional arrays rather than in tables. However, to our knowledge, there is nothing to d...